| Algorithms..::MergeSorted<(Of <T>)> Method (Comparison<(Of <T>)>, array<IEnumerable<(Of <T>)>>[]()) |
| See Also |
| |
[This topic is pre-release documentation and is subject to change in future releases. Blank topics are included as placeholders.]
Merge several sorted collections into a single sorted collection. Each input collection must be sorted
by the ordering in the passed Comparison<T> delegate. The merging
is stable; equal items maintain their ordering, and equal items in different collections are placed
in the order of the collections.
Namespace: Wintellect.PowerCollections
Assembly:
PowerCollections (in PowerCollections.dll)
Syntax
| C# |
|---|
public static IEnumerable<T> MergeSorted<T>( Comparison<T> comparison, params IEnumerable<T>[] collections ) |
| Visual Basic (Declaration) |
|---|
Public Shared Function MergeSorted(Of T) ( _ comparison As Comparison(Of T), _ ParamArray collections As IEnumerable(Of T)() _ ) As IEnumerable(Of T) |
| Visual C++ |
|---|
public: generic<typename T> static IEnumerable<T>^ MergeSorted ( Comparison<T>^ comparison, ... array<IEnumerable<T>^>^ collections ) |
Parameters
- comparison
- Comparison<(Of <T>)>
The comparison delegate used to sort the collections.
- collections
- array<IEnumerable<(Of <T>)>>[]()
The set of collections to merge. In many languages, this parameter can be specified as several individual parameters.
Return Value
An IEnumerable<T> that enumerates all the items in all the collections in sorted order.Type Parameters
- T
See Also
Algorithms Class
Wintellect.PowerCollections Namespace
Send comments about this topic to Microsoft.